Uniquely Parsable Accepting Grammar Systems
نویسندگان
چکیده
We extend the restrictions which induce unique parsability in Chomsky grammars to accepting grammar systems. It is shown that the accepting power of global RC-uniquely parsable accepting grammar systems equals the computational power of deterministic pushdown automata. More computational power, keeping the parsability without backtracking, is observed for local accepting grammar systems satisfying the pre x condition. We discuss a simple recognition algorithm for these systems. Category: F.4.2, F.4.3
منابع مشابه
Simulation of one-dimensional cellular automata by uniquely parallel parsable grammars
A uniquely parsable grammar (UPG) introduced by Morita et al. (1997) is a special kind of generative grammar where parsing can be performed without backtracking. By extending a UPG, a uniquely parallel parsable grammar (UPPG) was proposed and its unique parallel parsability has been investigated. In this paper, we show any one-dimensional cellular automaton (CA), as a parallel language recognit...
متن کاملGeneration and Parsing of Morphism Languages by Uniquely Parallel Parsable Grammars
A uniquely parsable grammar (UPG) introduced by Morita et al. (1997) is a kind of generative grammar, where parsing can be performed without backtracking. In this paper, we investigate a uniquely parallel parsable grammar (UPPG). We give a simple sufficient condition on morphism languages, and show that every such morphism language can be parsed efficiently in parallel by a UPPG. We show that t...
متن کاملA Generalization of the Offline Parsable Grammars
The offline parsable grammars apparently have enough formal power to describe human language, yet the parsing problem for these grammars is solvable. Unfortunately they exclude grammars that use x-bar theory and these grammars have strong linguistic justification. We define a more general class of unification grammars, which admits x-bar grammars while preserving the desirable properties of off...
متن کاملEfficient Factorization of Synchronous Context-Free Grammars
Factoring a Synchronous Context-Free Grammar into an equivalent grammar with a smaller number of nonterminals in each rule enables more efficient strategies for synchronous parsing. We present an algorithm for factoring an n-ary SCFG into a k-ary grammar in time O(kn). We also show how to efficiently compute the exact number of k-ary parsable permutations of length n, and discuss asymptotic beh...
متن کاملVariable-to-Fixed Length Codes and Plurally Parsable Dictionaries
A variable-toxed length encoding procedure is a mapping from a dictionary of variable length strings of source outputs to the set of codewords of a given length. For memoryless sources, the Tunstall procedure can be applied to construct optimal uniquely parsable dictionaries and the resulting codes are known to work especially well for sources with small entropies. We introduce the idea of plur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. UCS
دوره 6 شماره
صفحات -
تاریخ انتشار 2000